A Shortest Antecedent Set Algorithm for Mining Association Rules*
نویسنده
چکیده
Aiming at the redundancy problem of association rules in the mining process of mining association rules, a kind of shortest antecedent set algorithm (SASA) for mining association rules is proposed in this paper, and the algorithm is supported by the set-enumeration tree structure. The proposed algorithm is able to record a kind of subset for association rules without any information loss, and this kind of subset contains the entire generated association rule nondestructive. Experimental results show that the algorithm can significantly reduce the number of association rules, and it also improves the efficiency of analyzing the association rules for users.
منابع مشابه
Using a Data Mining Tool and FP-Growth Algorithm Application for Extraction of the Rules in two Different Dataset (TECHNICAL NOTE)
In this paper, we want to improve association rules in order to be used in recommenders. Recommender systems present a method to create the personalized offers. One of the most important types of recommender systems is the collaborative filtering that deals with data mining in user information and offering them the appropriate item. Among the data mining methods, finding frequent item sets and ...
متن کاملPrediction Mining - An Approach to Mining Association Rules for Prediction
An interesting application of association mining in the context temporal databases is that of prediction. Prediction is to use the antecedent of a rule to predict the consequent of the rule. But not all of association rules may be suitable for prediction. In this paper, we investigate the properties of rules for prediction, and develop an approach called prediction mining — mining a set of asso...
متن کاملA new approach based on data envelopment analysis with double frontiers for ranking the discovered rules from data mining
Data envelopment analysis (DEA) is a relatively new data oriented approach to evaluate performance of a set of peer entities called decision-making units (DMUs) that convert multiple inputs into multiple outputs. Within a relative limited period, DEA has been converted into a strong quantitative and analytical tool to measure and evaluate performance. In an article written by Toloo et al. (2009...
متن کاملA New Improved Apriori Algorithm for Association Rules Mining
In today's world of competitive business environment and popularization of computer and development of database, more and more data are stored in the large database. There is a great need to extract hidden and potentially meaningful information from large database. It is impossible to find useful information with traditional method. And then, data mining techniques have come as a reflection of ...
متن کاملIntroducing an algorithm for use to hide sensitive association rules through perturb technique
Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. Hiding the as...
متن کامل